Possibilistic decreasing persistence

نویسندگان

  • Dimiter Driankov
  • Jérôme Lang
چکیده

A key issue in the handling of temporal data is the treatment of persistence; in most approaches it consists in inferring defeasi­ ble conlusions by extrapolating from the ac­ tual knowledge of the history of the world; we propose here a gradual modelling of per­ sistence, following the idea that persistence is decreasing (the further we are from the last time point where a fluent is known to be true, the less certainly true the fluent is); it is based on possibility theory, which has strong relations with other well-known ordering-based approaches to nonmonotonic reasoning. We compare our approach with Dean and Kanazawa's probabilistic projec­ tion. We give a formal modelling of the decreasing persistence problem. Lastly, we show how to infer nonmonotonic conclusions using the principle of decreasing persistence.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Qualitative integrals and desintegrals as lower and upper possibilistic expectations

Any capacity (i.e., an increasing set function) has been proved to be a lower possibility measure and an upper necessity measure. Similarly, it is shown that any anti-capacity (i.e., a decreasing set function) can be viewed both as an upper guaranteed possibility measure and as a lower weak necessity measure. These results are the basis for establishing that qualitative integrals (including Sug...

متن کامل

Possibilistic Handling of Uncertain Default Rules with Applications to Persistence Modeling and Fuzzy Default Reasoning

Default rules express concise pieces of knowledge having implicit exceptions, which is appropriate for reasoning under incomplete information. Specific rules that explicitly refer to exceptions of more general rules can then be handled in this non-monotonic setting. However, there is no assessment of the certainty with which the conclusion of a default rule holds when it applies. We propose a f...

متن کامل

An Interactive Possibilistic Programming Approach to Designing a 3PL Supply Chain Network Under Uncertainty

The design of closed-loop supply chain networks has attracted increasing attention in recent decades with environmental concerns and commercial factors. Due to the rapid growth of knowledge and technology, the complexity of the supply chain operations is increasing daily and organizations are faced with numerous challenges and risks in their management. Most organizations with limited resources...

متن کامل

Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights

Recently, a temporal extension of the argumentation defeasible reasoning system DeLP has been proposed. This system, called t-DeLP, allows to reason defeasibly about changes and persistence over time but does not offer the possibility of ranking defeasible rules according to criteria of preference or certainty (in the sense of belief). In this contribution we extend t-DeLP by allowing to attach...

متن کامل

A New Combination of Robust-possibilistic Mathematical Programming for Resilient Supply Chain Network under Disruptions and Uncertainty: A Real Supply Chain (RESEARCH NOTE)

Nowadays, the design of a strategic supply chain network under disruption is one of the most important priorities of the governments. One of the strategic purposes of managers is to supply the sustainable agricultural products and food in stable conditions which require the production of soil nutrients. In this regard, some disruptions such as sanctions and natural disasters have a destructive ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993